Reconstruction of Binary Matrices Satisfying Neighborhood Constraints by Simulated Annealing
نویسنده
چکیده
This paper considers the NP-hard problem of reconstructing binary matrices satisfying exactly-1-4-adjacency constraint from its row and column projections. This problem is formulated into a maximization problem. The objective function gives a measure of adjacency constraint for the binary matrices. The maximization problem is solved by the simulated annealing algorithm and experimental results are presented. Keywords—Discrete Tomography, exactly-1-4-adjacency, simulated annealing.
منابع مشابه
Reconstruction of binary matrices from fan-beam projections
The problem of the reconstruction of binary matrices from their fan-beam projections is investigated here. A fan-beam projection model is implemented and afterwards employed in systematic experiments to determine the optimal parameter values for a data acquisition and reconstruction algorithm. The fan-beam model, the reconstruction algorithm which uses the optimization method of Simulated Annea...
متن کاملReconstructing Binary Matrices with Neighborhood Constraints: An NP-hard Problem
This paper deals with the reconstruction of binary matrices having exactly-1-4-neighborhood constraints from the horizontal and vertical projections. This problem is shown to be NP-hard by means of a reduction which involve the NP-hard problem 3-color.
متن کاملA SA-VNS approach for the High School Timetabling Problem
The High School Timetabling Problem consists in assigning timeslots and resources to events, satisfying constraints which heavily depend on the specific institution. This work deals with the problem of the ongoing III International Timetabling Competition (ITC), which includes a diverse set of instances from many educational institutions around the world. We proposed an approach based on Simula...
متن کاملReconstruction of binary matrices under fixed size neighborhood constraints
Using a dynamic programming approach, we prove that a large variety of matrix reconstruction problems from two projections can be solved in polynomial timewhenever the number of rows (or columns) is fixed. We also prove some complexity results for several problems concerning the reconstruction of a binary matrix when a neighborhood constraint occurs. © 2008 Elsevier B.V. All rights reserved.
متن کاملSIMULATED ANNEALING TO IMPROVE VARIABLE ORDERINGS FOR OBDDs
The choice of a good variable ordering is crucial in applications of Ordered Binary Decision Diagrams (OBDDs). A simulated annealing approach with a new type of neighborhood is presented and analyzed. Better results as by known simulated annealing algorithms and heuristics are obtained. Some theoretical results underlining the experiments are stated.
متن کامل